Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("Erlebach, Thomas")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 112

  • Page / 5
Export

Selection :

  • and

Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

Algorithms (ESA 2006)Azar, Yossi; Erlebach, Thomas.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38875-3, 1Vol, XVIII-843 p, isbn 3-540-38875-3Conference Proceedings

The complexity of path coloring and call schedulingERLEBACH, Thomas; JANSEN, Klaus.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 33-50, issn 0304-3975Article

Deciding relaxed two-colorability : A hardness jumpBERKE, Robert; SZABO, Tibor.Lecture notes in computer science. 2006, pp 124-135, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Finding total unimodularity in optimization problems solved by linear programsDÜRR, Christoph; HURAND, Mathilde.Lecture notes in computer science. 2006, pp 315-326, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Single machine precedence constrained scheduling is a vertex cover problemAMBÜHL, Christoph; MASTROLILLI, Monaldo.Lecture notes in computer science. 2006, pp 28-39, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Tighter approximations for maximum induced matchings in regular graphsGOTTHILF, Zvi; LEWENSTEIN, Moshe.Lecture notes in computer science. 2006, pp 270-281, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 12 p.Conference Paper

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemBILO, Davide; GUALA, Luciano; PROIETTI, Guido et al.Lecture notes in computer science. 2006, pp 19-30, issn 0302-9743, isbn 3-540-48822-7, 12 p.Conference Paper

Estimating entropy over data streamsBHUVANAGIRI, Lakshminath; GANGULY, Sumit.Lecture notes in computer science. 2006, pp 148-159, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Lower and upper bounds on FIFO buffer management in QoS switchesENGLERT, Matthias; WESTERMANN, Matthias.Lecture notes in computer science. 2006, pp 352-363, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α < d Case)LINGAS, Andrzej; PERSSON, Mia; WAHLEN, Martin et al.Lecture notes in computer science. 2006, pp 112-124, issn 0302-9743, isbn 3-540-48822-7, 13 p.Conference Paper

A better-than-greedy algorithm for k-set multicoverFUJITO, Toshihiro; KURAHASHI, Hidekazu.Lecture notes in computer science. 2006, pp 176-189, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Approximate k-steiner forests via the lagrangian relaxation technique with internal preprocessingSEGEV, Danny; SEGEV, Gil.Lecture notes in computer science. 2006, pp 600-611, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Cheating by men in the gale-shapley stable matching algorithmHUANG, Chien-Chung.Lecture notes in computer science. 2006, pp 418-431, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 14 p.Conference Paper

Distributed almost exact approximations for minor-closed familiesCZYGRINOW, Andrzej; HANCKOWIAK, Michal.Lecture notes in computer science. 2006, pp 244-255, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Dynamic programming and fast matrix multiplicationDORN, Frederic.Lecture notes in computer science. 2006, pp 280-291, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

How branch mispredictions affect quicksortKALIGOSI, Kanela; SANDERS, Peter.Lecture notes in computer science. 2006, pp 780-791, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Near-entropy hotlink assignmentsDOUÏEB, Karim; LANGERMAN, Stefan.Lecture notes in computer science. 2006, pp 292-303, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

On approximating restricted ycle coversMANTHEY, Bodo.Lecture notes in computer science. 2006, pp 282-295, issn 0302-9743, isbn 3-540-32207-8, 1Vol, 14 p.Conference Paper

Path hitting in acyclic graphsPAREKH, Ojas; SEGEV, Danny.Lecture notes in computer science. 2006, pp 564-575, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

An O(n3 (log log n/log n )5/4) time algorithm for all pairs shortest pathsYIJIE HAN.Lecture notes in computer science. 2006, pp 411-417, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 7 p.Conference Paper

Dynamic algorithms for graph spannersBASWANA, Surender.Lecture notes in computer science. 2006, pp 76-87, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Exact and efficient construction of planar minkowski sums using the convolution methodWEIN, Ron.Lecture notes in computer science. 2006, pp 829-840, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

Greedy in approximation algorithmsMESTRE, Julian.Lecture notes in computer science. 2006, pp 528-539, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

I/O-efficient undirected shortest paths with unbounded edge lengths (Extended Abstract)MEYER, Ulrich; ZEH, Norbert.Lecture notes in computer science. 2006, pp 540-551, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 12 p.Conference Paper

  • Page / 5